Algorithms for target transformations of lattice basis vectors
نویسندگان
چکیده
منابع مشابه
Faster Algorithms for Integer Lattice Basis Reduction
The well known L 3-reduction algorithm of Lovv asz transforms a given integer lattice basis b1; b2
متن کاملOn Transformations of Random Vectors
This technical report treats some technical considerations related to the probability density function of a function of a random vector.
متن کاملApproximate Algorithms for Minimization of Binary Decision Diagrams on the Basis of Linear Transformations of Variables
Algorithms for an approximate minimization of binary decision diagrams (BDD) on the basis of linear transformations of variables are proposed. The algorithms rely on the transformations of only adjacent variables and have a polynomial complexity relative to the size of the table that lists values of the function involved.
متن کاملVectors, Matrices and Coordinate Transformations
For our purposes we will think of a vector as a mathematical representation of a physical entity which has both magnitude and direction in a 3D space. Examples of physical vectors are forces, moments, and velocities. Geometrically, a vector can be represented as arrows. The length of the arrow represents its magnitude. Unless indicated otherwise, we shall assume that parallel translation does n...
متن کاملCounting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ♯Pcomplete resolving an open problem. Furthermore, we show that the problem is at least as hard as integer factorization even for lattices of bounded rank or lattices generated by vectors of bounded norm. Next, we discu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica Section A Foundations and Advances
سال: 2020
ISSN: 2053-2733
DOI: 10.1107/s2053273320012668